A$^2$ILU: Auto-accelerated ILU Preconditioner for Sparse Linear Systems
نویسندگان
چکیده
منابع مشابه
A2ILU: Auto-accelerated ILU Preconditioner for Sparse Linear Systems
The ILU-based preconditioning methods in previous work have their own parameters to improve their performances. Although the parameters may degrade the performance, their determination is left to users. Thus, these previous methods are not reliable in practical computer-aided engineering use. This paper proposes a novel ILU-based preconditioner called the auto-accelerated ILU, or AILU. In order...
متن کاملBILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
We introduce block versions of the multielimination incomplete LU (ILUM) factorization preconditioning technique for solving general sparse unstructured linear systems. These preconditioners have a multilevel structure and, for certain types of problems, may exhibit properties that are typically enjoyed by multigrid methods. Several heuristic strategies for forming blocks of independent sets ar...
متن کاملILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
Standard preconditioning techniques based on incomplete LU (ILU) factorizations offer a limited degree of parallelism, in general. A few of the alternatives advocated so far consist of either using some form of polynomial preconditioning, or applying the usual ILU factorization to a matrix obtained from a multicolor ordering. In this paper we present an incomplete factorization technique based ...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
This paper is concerned with a new approach to preconditioning for large sparse linear systems A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient type methods Some theoretical properties of the preconditioner are discussed a...
متن کاملA Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superior to AS in terms of both iteration counts and CPU time, as well as the communication cost when implemented on distributed memory computers. This is especially true for harder problems such as indefi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2013
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110842685